Robust Joint Huffman and Convolutional Decoding
نویسندگان
چکیده
We introduce a joint decoding algorithm for a Huffman source code followed by a convolutional channel code. The algorithm incorporates a restriction to valid Huffman codewords into the convolutional code’s trellis. Performance is improved by this restriction. Furthermore, soft Huffman decoding is implicitly included, and a priori probabilities of input symbols can be easily exploited, if available. The joint decoding algorithm demonstrates significantly improved robustness relative to a system in which source and channel decoding are performed separately.
منابع مشابه
Bit-Based Joint Source-Channel Decoding of Huffman Encoded Markov Multiple Sources
Multimedia transmission over time-varying channels such as wireless channels has recently motivated the research on the joint source-channel technique. In this paper, we present a method for joint source-channel soft decision decoding of Huffman encoded multiple sources. By exploiting the a priori bit probabilities in multiple sources, the decoding performance is greatly improved. Compared with...
متن کاملAn Integrated Joint Source-Channel Decoder for MPEG-4 Coded Video
The MPEG-4 video coding standard uses variable length codes (VLCs) to encode the indices of intra and inter macroblocks after discrete cosine transform and quantization. Although VLCs can achieve good compression, they are very sensitive to channel errors. Joint source-channel decoding (JSCD) is emerging as an efficient method for dealing with this sensitivity to channel errors. This paper prop...
متن کاملتجزیه و تحلیل عملکرد کدهای کانولوشنال تعریف شده در میدان حقیقی در کانال فیدینگ و در حضور نویز کوانتیزاسیون
Channel coding is one of the techniques used for suppression of fading and channel noise effects. Most of the researches on channel codes have been focused on the codes which are defined on Galois fields. Since two decades ago, using channel codes defined on Real and Complex fields has been considered for joint sourcechannel coding in multimedia transmission; but most of the works have focused ...
متن کاملSoft and Joint Source-Channel Decoding of Quasi-Arithmetic Codes
The issue of robust and joint source-channel decoding of quasi-arithmetic codes is addressed. Quasi-arithmetic coding is a reduced precision and complexity implementation of arithmetic coding. This amounts to approximating the distribution of the source. The approximation of the source distribution leads to the introduction of redundancy that can be exploited for robust decoding in presence of ...
متن کاملRobust transmission of variable-length encoded sources
Digital communications systems commonly use compression (source coding) and error control (channel coding) to allow efficient and robust transmission of data over noisy channels. When compression is imperfect, some residual redundancy remains in the transmitted data and can be exploited at the decoder to improve the decoder’s probability-of-error performance. A new approach to joint source-chan...
متن کامل